Mappings Associated with Vertex Triangles
نویسندگان
چکیده
Methods of linear algebra are applied to triangle geometry. The vertex triangle of distinct circumcevian triangles is proved to be perspective to the reference triangle ABC, and similar results hold for three other classes of vertex triangles. Homogeneous coordinates of the perspectors define four mappings Mi on pairs of points (U, X). Many triangles homothetic to ABC are examined, and properties of the four mappings are presented. In particular, Mi(U,X) = Mi(X, U) for i = 1, 2, 3, 4, and M1(U,M1(U, X)) = X; for this reason, M1(U, X) is given the name U -vertex conjugate of X. In the introduction of this work, point is defined algebraically as a homogeneous function of three variables. Subsequent definitions and methods include symbolic substitutions, which are strictly algebraic rather than geometric, but which have far-reaching geometric implications.
منابع مشابه
Successive Mappings: An Approach to Polygonal Mesh Simplification with Guaranteed Error Bounds
We present the use of mapping functions to automatically generate levels of detail with known error bounds for polygonal models. We develop a piece-wise linear mapping function for each simplification operation and use this function to measure deviation of the new surface from both the previous level of detail and from the original surface. In addition, we use the mapping function to compute ap...
متن کاملSome finite groups with divisibility graph containing no triangles
Let $G$ be a finite group. The graph $D(G)$ is a divisibility graph of $G$. Its vertex set is the non-central conjugacy class sizes of $G$ and there is an edge between vertices $a$ and $b$ if and only if $a|b$ or $b|a$. In this paper, we investigate the structure of the divisibility graph $D(G)$ for a non-solvable group with $sigma^{ast}(G)=2$, a finite simple group $G$ that satisfies the one-p...
متن کاملUniversal Meshes: A new paradigm for computing with nonconforming triangulations
We describe a method for discretizing planar C2-regular domains immersed in nonconforming triangulations. The method consists in constructing mappings from triangles in a background mesh to curvilinear ones that conform exactly to the immersed domain. Constructing such a map relies on a novel way of parameterizing the immersed boundary over a collection of nearby edges with its closest point pr...
متن کاملBarycentric Mappings
As in the previous chapter, let us denote points in R by p = (x, y, z) and points in R by u = (u, v). An edge is then defined as the convex hull of (or, equivalently, the line segment between) two distinct points and a triangle as the convex hull of three non-collinear points. We will denote edges and triangles in R with capital letters and those in R with small letters, for example, e = [u1,u2...
متن کاملPacking interval graphs with vertex-disjoint triangles
We show that there exists a polynomial algorithm to pack interval graphs with vertex-disjoint triangles.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009